How to delete categorically — Two pushout complement constructions
نویسندگان
چکیده
منابع مشابه
How to delete categorically - Two pushout complement constructions
In category theory, most set-theoretic constructions—union, intersection, etc.—have direct categorical counterparts. But up to now, there is no direct construction of a deletion operation like the set-theoretic complement. In rule-based transformation systems, deletion of parts of a given object is one of the main tasks. In the double pushout approach to algebraic graph transformation, the cons...
متن کاملHow to Delete a Secret
This paper discusses the secure data erasure problem and introduces a new Proof of Deletion protocol, which assures secure data deletion in a way that any independent third party can verify cryptographically. The use of cryptography in data deletion is not new, but previous solutions are unsatisfactory as they merely return a single bit: whether the deletion is successful. However, this single ...
متن کاملChanging Labels in the Double-Pushout Approach Can Be Treated Categorically
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into consideration productions that change labels, however, may add ambiguity even in the case of injective graph productions. A well-known solution to this problem is restricting the categorical treatment to the underlyi...
متن کاملThe Right to Delete
Most of us have incidents in our past that we'd rather leave there, but that is increasingly difficult in a world teeming with devices and services that capture our words and actions and record them indefinitely. Instead of organically being forgotten, records of the past increasingly persist in digital storage unless and until they are deleted by someone. Should an individual have the right to...
متن کاملHow Constructions Mean
One of the major motivations for a constructionbased approach to syntax is that a given rule of syntactic formation can often be associated with more than one semantic specification. For example, a pair of expressions like purple plum and alleged thief call on different rules of semantic combination. The first involves something related to intersection of sets: a purple plum is a member of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2010.09.007